TSTP Solution File: SEV391^5 by Duper---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Duper---1.0
% Problem : SEV391^5 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : duper %s
% Computer : n025.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Aug 31 19:24:52 EDT 2023
% Result : Theorem 3.68s 3.84s
% Output : Proof 3.68s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : SEV391^5 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.15 % Command : duper %s
% 0.16/0.36 % Computer : n025.cluster.edu
% 0.16/0.36 % Model : x86_64 x86_64
% 0.16/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36 % Memory : 8042.1875MB
% 0.16/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36 % CPULimit : 300
% 0.16/0.36 % WCLimit : 300
% 0.16/0.36 % DateTime : Thu Aug 24 03:46:21 EDT 2023
% 0.16/0.36 % CPUTime :
% 3.68/3.84 SZS status Theorem for theBenchmark.p
% 3.68/3.84 SZS output start Proof for theBenchmark.p
% 3.68/3.84 Clause #0 (by assumption #[]): Eq (Not (Exists fun Xv => ∀ (Xj : Iota), Exists fun Xq => Or (cP a (h Xj) Xj) (cP Xv (k Xj) Xj) → cP Xv Xq Xj)) True
% 3.68/3.84 Clause #1 (by clausification #[0]): Eq (Exists fun Xv => ∀ (Xj : Iota), Exists fun Xq => Or (cP a (h Xj) Xj) (cP Xv (k Xj) Xj) → cP Xv Xq Xj) False
% 3.68/3.84 Clause #2 (by clausification #[1]): ∀ (a_1 : Iota), Eq (∀ (Xj : Iota), Exists fun Xq => Or (cP a (h Xj) Xj) (cP a_1 (k Xj) Xj) → cP a_1 Xq Xj) False
% 3.68/3.84 Clause #3 (by clausification #[2]): ∀ (a_1 a_2 : Iota),
% 3.68/3.84 Eq
% 3.68/3.84 (Not
% 3.68/3.84 (Exists fun Xq =>
% 3.68/3.84 Or (cP a (h (skS.0 0 a_1 a_2)) (skS.0 0 a_1 a_2)) (cP a_1 (k (skS.0 0 a_1 a_2)) (skS.0 0 a_1 a_2)) →
% 3.68/3.84 cP a_1 Xq (skS.0 0 a_1 a_2)))
% 3.68/3.84 True
% 3.68/3.84 Clause #4 (by clausification #[3]): ∀ (a_1 a_2 : Iota),
% 3.68/3.84 Eq
% 3.68/3.84 (Exists fun Xq =>
% 3.68/3.84 Or (cP a (h (skS.0 0 a_1 a_2)) (skS.0 0 a_1 a_2)) (cP a_1 (k (skS.0 0 a_1 a_2)) (skS.0 0 a_1 a_2)) →
% 3.68/3.84 cP a_1 Xq (skS.0 0 a_1 a_2))
% 3.68/3.84 False
% 3.68/3.84 Clause #5 (by clausification #[4]): ∀ (a_1 a_2 a_3 : Iota),
% 3.68/3.84 Eq
% 3.68/3.84 (Or (cP a (h (skS.0 0 a_1 a_2)) (skS.0 0 a_1 a_2)) (cP a_1 (k (skS.0 0 a_1 a_2)) (skS.0 0 a_1 a_2)) →
% 3.68/3.84 cP a_1 a_3 (skS.0 0 a_1 a_2))
% 3.68/3.84 False
% 3.68/3.84 Clause #6 (by clausification #[5]): ∀ (a_1 a_2 : Iota),
% 3.68/3.84 Eq (Or (cP a (h (skS.0 0 a_1 a_2)) (skS.0 0 a_1 a_2)) (cP a_1 (k (skS.0 0 a_1 a_2)) (skS.0 0 a_1 a_2))) True
% 3.68/3.84 Clause #7 (by clausification #[5]): ∀ (a a_1 a_2 : Iota), Eq (cP a a_1 (skS.0 0 a a_2)) False
% 3.68/3.84 Clause #8 (by clausification #[6]): ∀ (a_1 a_2 : Iota),
% 3.68/3.84 Or (Eq (cP a (h (skS.0 0 a_1 a_2)) (skS.0 0 a_1 a_2)) True) (Eq (cP a_1 (k (skS.0 0 a_1 a_2)) (skS.0 0 a_1 a_2)) True)
% 3.68/3.84 Clause #10 (by superposition #[7, 8]): ∀ (a_1 a_2 : Iota), Or (Eq (cP a (h (skS.0 0 a_1 a_2)) (skS.0 0 a_1 a_2)) True) (Eq True False)
% 3.68/3.84 Clause #11 (by clausification #[10]): ∀ (a_1 a_2 : Iota), Eq (cP a (h (skS.0 0 a_1 a_2)) (skS.0 0 a_1 a_2)) True
% 3.68/3.84 Clause #12 (by superposition #[11, 7]): Eq True False
% 3.68/3.84 Clause #13 (by clausification #[12]): False
% 3.68/3.84 SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------